Paired domination in prisms of graphs
نویسندگان
چکیده
The paired domination number γpr(G) of a graph G is the smallest cardinality of a dominating set S of G such that 〈S〉 has a perfect matching. The generalized prisms πG of G are the graphs obtained by joining the vertices of two disjoint copies of G by |V (G)| independent edges. We provide characterizations of the following three classes of graphs: γpr(πG) = 2γpr(G) for all πG; γpr(K2 G) = 2γpr(G); γpr(K2 G) = γpr(G).
منابع مشابه
Coverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملPaired-Domination Game Played in Graphs
In this paper, we continue the study of the domination game in graphs introduced by Bre{v{s}}ar, Klav{v{z}}ar, and Rall. We study the paired-domination version of the domination game which adds a matching dimension to the game. This game is played on a graph $G$ by two players, named Dominator and Pairer. They alternately take turns choosing vertices of $G$ such that each vertex chosen by Domin...
متن کاملPaired domination on interval and circular-arc graphs
We study the paired-domination problem on interval graphs and circular-arc graphs. Given an interval model with endpoints sorted, we give an O(m + n) time algorithm to solve the paired-domination problem on interval graphs. The result is extended to solve the paired-domination problem on circular-arc graphs in O(m(m+ n)) time. MSC: 05C69, 05C85, 68Q25, 68R10, 68W05
متن کاملThe Paired-domination and the Upper Paired-domination Numbers of Graphs
In this paper we continue the study of paired-domination in graphs. A paired–dominating set, abbreviated PDS, of a graph G with no isolated vertex is a dominating set of vertices whose induced subgraph has a perfect matching. The paired-domination number of G, denoted by γp(G), is the minimum cardinality of a PDS of G. The upper paired–domination number of G, denoted by Γp(G), is the maximum ca...
متن کاملFe b 20 08 Labelling Algorithms for Paired - domination Problems in Block and Interval Graphs ∗
Let G = (V,E) be a graph without isolated vertices. A set S ⊆ V is a paired-domination set if every vertex in V − S is adjacent to a vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination problem is to determine the paired-domination number, which is the minimum cardinality of a paired-dominating set. Motivated by a mistaken algorithm given by Chen, Kang an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 31 شماره
صفحات -
تاریخ انتشار 2011